s=input()
n=len(s)
z=[]
k=0
b=0
for i in range(n):
z.append(s[i])
b+=1
if b>=2:
if z[b-2]=='(' and z[b-1]==')':
z.pop(b-1)
z.pop(b-2)
k+=2
b-=2
print(k)//
// main.cpp
// J - Regular Bracket Sequence
//
// Created by Farrah Tharwat on 20/01/2023.
//
#include <iostream>
#include <stack>
#include <algorithm>
using namespace std;
int main() {
stack<int> stack;
int cnt=0;
string x;
cin>>x;
for(int i=0; i<x.length();i++){
if(x[i]=='('){
stack.push(x[i]);
}
else if(x[i]==')'){
if(!stack.empty()){
stack.pop();
cnt++;
}
}
}
cout<<cnt*2<<endl;
}
841. Keys and Rooms | 152. Maximum Product Subarray |
337. House Robber III | 869. Reordered Power of 2 |
1593C - Save More Mice | 1217. Minimum Cost to Move Chips to The Same Position |
347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |